Skewness-Based Min-Min Max-Min Heuristic for Grid Task Scheduling
نویسندگان
چکیده
Skewness plays a very important role in task scheduling. It measures the degree of asymmetry in a data set. Moreover, the data set may be positively skewed or negatively skewed. The quartile coefficient of skewness lies in between -1 to 1. If the quartile coefficient is in between -1 to 0, then the data set is negatively skewed. Otherwise, it is positively skewed. Min-Min and Max-Min heuristic underperforms if the data set is positively skewed and negative skewed respectively. In order to overcome this problem, we have proposed a hybrid heuristic called Skewness-Based Min-Min Max-Min (SBM). This heuristic selects one of the heuristics (Min-Min or Max-Min) based on the skewness value. It can be calculated using three factors: first quartile, second quartile (or median) and third quartile. Simulation results show that the proposed hybrid heuristic minimizes the makespan and handle the skewed data set. Keywords-Skewness; Min-Min; Max-Min; Makespan; Grid Scheduling; Data Set; Machine Utilization
منابع مشابه
QoS Guided Heuristic Algorithms for Grid Task Scheduling
Due to the heterogeneity and geographically distribution of Grid resources, effective and efficient task scheduling algorithms are required. Resource load balancing and minimizing makespan are the fundamental goals of effective and efficient task scheduling. It becomes more complicated when various QoS demands arise from users. In this paper, we have presented two algorithms, QoS Guided Weighte...
متن کاملA Hybrid Min-min Max-min Algorithm with Improved Performance
The high cost of supercomputers and the need for large-scale computational resources has led to the development of network of computational resources known as Grid. To better use tremendous capabilities of this large scale distributed system, effective and efficient scheduling algorithms are needed. Many such algorithms have been designed and implemented. We introduce a new scheduling algorithm...
متن کاملA Double Min Min Algorithm for Task Metascheduler on Hypercubic P2P Grid Systems
Most of the existing solutions on task scheduling and resource management in grid computing are based on the traditional client/ server model, enforcing a homogeneous policy on making decisions and limiting the flexibility, unpredictable reliability and scalability of the system. Thus, we need well organized system architecture to provide high system availability with task scheduling scheme for...
متن کاملFault-tolerance Aware Multi Objective Scheduling Algorithm for Task Scheduling in Computational Grid
Computational Grid (CG) creates a large heterogeneous and distributed paradigm to manage and execute the applications which are computationally intensive. In grid scheduling tasks are assigned to the proper processors in the grid system to for its execution by considering the execution policy and the optimization objectives. In this paper, makespan and the faulttolerance of the computational no...
متن کاملScheduling Jobs on Grid Computing Using Firefly Algorithm
Scheduling jobs on computational grids is identified as NP-complete problem due to the heterogeneity of resources; the resources belong to different administrative domains and apply different management policies. This paper presents a novel metaheuristics method based on Firefly Algorithm (FA) for scheduling jobs on grid computing. The proposed method is to dynamically create an optimal schedul...
متن کامل